Improved Achievability and Converse Bounds for Erdos-Renyi Graph Matching

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Improved Achievability and Converse Bounds for Erd\H{o}s-R\'enyi Graph Matching

ABSTRACT We consider the problem of perfectly recovering the vertex correspondence between two correlated Erdős-Rényi (ER) graphs. For a pair of correlated graphs on the same vertex set, the correspondence between the vertices can be obscured by randomly permuting the vertex labels of one of the graphs. In some cases, the structural information in the graphs allow this correspondence to be reco...

متن کامل

Limit Laws of Erdos - Renyi - Shepp Type

Tn = max1_< 0 is a given constant . We assume that the random variables X i are centered and have a finite moment generating function in a right neighborhood of zero, and obtain among other results the full form of the Erdos-Renyi (1970) and...

متن کامل

The Erdos-renyi Strong Law for Patfern Matching with a given Proportion of Mismatches

University of Southern Califontia Consider two random sequences XI 3 . . X, and . . . Y, of i.i.d. letters in which the probability that two distinct letters match is p > 0. For each value a between p and 1, the length of the longest contiguous matching between the two sequences, requiring only a proportion a of corresponding letters to match, satisfies a strong law analogous to the Erd&-&yi la...

متن کامل

Improved bounds for stochastic matching

This results in this paper have been merged with the result in arXiv:1003.0167. The authors would like to withdraw this version. Please see arXiv:1008.5356 for the merged version.

متن کامل

Exact alignment recovery for correlated Erdos Renyi graphs

We consider the problem of perfectly recovering the vertex correspondence between two correlated Erdős-Rényi (ER) graphs on the same vertex set. The correspondence between the vertices can be obscured by randomly permuting the vertex labels of one of the graphs. We determine the information-theoretic threshold for exact recovery, i.e. the conditions under which the entire vertex correspondence ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ACM SIGMETRICS Performance Evaluation Review

سال: 2016

ISSN: 0163-5999

DOI: 10.1145/2964791.2901460